Parallel Block-Diagonal-Bordered Sparse Linear Solvers for Electrical Power System Applications
نویسندگان
چکیده
Research is ongoing that examines parallel direct block-diagonal-bordered sparse linear solvers for irregular sparse matrix problems derived from electrical power system applications. Parallel block-diagonal-bordered sparse linear solvers exhibit distinct advantages when compared to current general parallel direct sparse matrix solvers. Our research shows that actual power system matrices can be readily ordered into block-diagonal-bordered form, although load imbalance becomes excessive beyond 16 processors, limiting scala-bility for a single parallel linear solver within an application. Nevertheless, other dimensions exist in electrical power system applications that can be exploited to eeciently make use of large-scale multi-processors.
منابع مشابه
Stabilized bordered block diagonal forms for parallel sparse solvers
We use the duality between a singly bordered and a doubly bordered block diagonal form to produce an efficient method of obtaining the stable factorization of a bordered system. This is particularly important in the exploitation of coarse-grained parallelism. We show how our partitioning and factorization scheme relates to domain decomposition partitioning but has greater control over stability...
متن کاملSingly-Bordered Block-Diagonal Form for Minimal Problem Solvers
The Gröbner basis method for solving systems of polynomial equations became very popular in the computer vision community as it helps to find fast and numerically stable solutions to difficult problems. In this paper, we present a method that potentially significantly speeds up Gröbner basis solvers. We show that the elimination template matrices used in these solvers are usually quite sparse a...
متن کاملA Parallel Gauss-Seidel Algorithm for Sparse Power Systems Matrices
We describe the implementation and performance of an e cient parallel Gauss-Seidel algorithm that has been developed for irregular, sparse matrices from electrical power systems applications. Although, Gauss-Seidel algorithms are inherently sequential, by performing specialized orderings on sparse matrices, it is possible to eliminate much of the data dependencies caused by precedence in the ca...
متن کاملTwo-stage ordering for unsymmetric parallel row-by-row frontal solvers
The row-by-row frontal method may be used to solve general large sparse linear systems of equations. By partitioning the matrix into (nearly) independent blocks and applying the frontal method to each block, a coarse-grained parallel frontal algorithm is obtained. The success of this approach depends on preordering the matrix. This can be done in two stages, (1) order the matrix to bordered blo...
متن کاملA Parallel Block Frontal Solver For Large Scale Process Simulation: Reordering Effects
For the simulation and optimization of large-scale chemical processes, the overall computing time is often dominated by the time needed to solve a large sparse system of linear equations. We describe here a parallel frontal solver which can significantly reduce the wallclock time required to solve these linear equation systems using parallel/vector supercomputers. The algorithm exploits both mu...
متن کامل